2-Adic complexity of binary sequences with interleaved structure
نویسندگان
چکیده
منابع مشابه
Linear Complexity of Some Binary Interleaved Sequences of Period 4N
It is necessary that the linear complexity of a key stream sequence in a stream cipher system is not less than half of a period. This paper puts forward the linear complexity of a class of binary interleaved sequences with period 4N over the finite field with characteristic 2. Results show that the linear complexity of some of these sequences satisfies the requirements of cryptography.
متن کاملThe 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been used in designing reliable stream ciphers. In this paper, we obtain the exact autocorrelation distribution of a class of sequence with three-level autocorrelation and analyze the 2-adic complexity of this sequence. Our results show that the 2-adic co...
متن کاملComments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملNew Constructions of Binary Interleaved Sequences with Low Autocorrelation
The autocorrelation of a key stream sequence in a stream cipher is an important cryptographic property. This paper proposes two constructions of binary interleaved sequences of period 4N by selecting appropriate shift sequences, subsequences and complement sequences. And the autocorrelation functions of new sequences are given. The results show that these sequences have low autocorrelation unde...
متن کاملStructure Analysis on the $k$-error Linear Complexity for $2^n$-periodic Binary Sequences
In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for 2-periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed k-error cube decomposition, and the famous inclusion-exclusion principle, we obtain the complete characterization of ith descent point (critical point) of the k-error linear complexity for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2015
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2014.09.009